Nonconvex Optimal Control Problems with Nonsmooth Mixed State Constraints
نویسندگان
چکیده
Necessary conditions of optimality in the form of a weak maximum principle are derived for optimal control problems with mixed constraints. Such conditions differ from previous work since they hold when a certain convexity assumption is replaced by an “interiority” assumption. Notably the result holds for problems with possibly nonsmooth mixed constraints and with additional pointwise set control constraints. Essential to all the analysis is a nonsmooth version of the well known positive linear independence conditions on the mixed constraints.
منابع مشابه
Unmaximized Inclusion Type Conditions for Nonconvex Constrained Optimal Control Problems
Necessary conditions of optimality in the form of an unmaximized Inclusion (UI) are derived for optimal control problems with state constraints. The conditions presented here generalize earlier optimality conditions to problems that may be nonconvex. The derivation of UI type conditions in the absence of the convexity assumption is of particular importance when deriving necessary conditions for...
متن کاملNecessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints
In this paper we study an optimal control problem with nonsmooth mixed state and control constraints. In most of the existing results, the necessary optimality condition for optimal control problems with mixed state and control constraints are derived under the Mangasarian-Fromovitz condition and under the assumption that the state and control constraint functions are smooth. In this paper we d...
متن کاملOptimal Control of Nonconvex Discrete and Differential Inclusions
Optimization problems for discrete and diierential inclusions have many important applications and generalize both standard and nonstandard models in optimal control for open-loop and closed-loop control systems. In this paper we consider optimal control problems for dynamic systems governed by such inclusions with general endpoint constraints. We provide a variational analysis of diierential i...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملApproximate Maximum Principle for Discrete Approximations of Optimal Control Systems with Nonsmooth Objectives and Endpoint Constraints
The paper studies discrete/finite-difference approximations of optimal control problems governed by continuous-time dynamical systems with endpoint constraints. Finitedifference systems, considered as parametric control problems with the decreasing step of discretization, occupy an intermediate position between continuous-time and discrete-time (with fixed steps) control processes and play a si...
متن کامل